Use of a Persistent Graph Abstract Data Type for Representing CASE Tool Repositories
نویسنده
چکیده
This paper presents a persistent graph abstract data type which is suited to the implementation of repositories for CASE tools. it contains both deductive database and persistent graph representations of repositories for several CASE tools, in particular the entity-relationship-atttribute methodfor conceptual data modelling. It shows that while the deductive database approach is feasible, a PGADT implementation would be superior.
منابع مشابه
A Framework for Extended Persistent Identification of Scientific Assets
Several scientific communities relying on e-science infrastructures are in need of persistent identifiers for data and contextual information. In this article, we present a framework for persistent identification that fundamentally supports context information. It is installed as a number of low-level requirements and abstract data type descriptions, flexible enough to envelope context informat...
متن کاملIRS-1C image data applications for land use/land cover mapping in Zagros region, Case study: Ilam watershed, West of Iran
In land use planning, mapping the present land use / land cover situation is a necessary tool for determining the current condition and for identifying land use trends. In this study, in order to provide a land use/ land cover map for Ilam watershed, the IRS-1C image data from 25th April 2006 were used. Initial qualitative evaluation on data showed no significant radiometric error. Ortho-rectif...
متن کاملقابلیت نظام‌های اطلاعات بیمارستانی کشور جهت استقرار پزشکی مبتنی بر شواهد
Background and Aim: Evidence Based Medicine (EBM) is the explicit use of current best evidence in making decisions about the care of individual patients. Hospital information system (HIS) can act as a bridge between medical data and medical knowledge through merging of patient's data, individual clinical knowledge and external evidences .The aim of this research was to determine the Capab...
متن کاملGraph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members
Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...
متن کاملRepresenting Web Graphs
A Web repository is a large special-purpose collection of Web pages and associated indexes. Many useful queries and computations over such repositories involve traversal and navigation of the Web graph. However, efficient traversal of huge Web graphs containing several hundred million vertices and a few billion edges is a challenging problem. An additional complication is the lack of a schema t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000